Condition numbers and scale free graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

Title Scale Free Interval Graphs

Scale free graphs have attracted attention by their non-uniform structure that can be used as a model for various social and physical networks. In this paper, we propose a natural and simple random model for generating scale free interval graphs. The model generates a set of intervals randomly under a certain distribution, which defines a random interval graph. The main advantage of the model i...

متن کامل

NORTH- HOLLAND Condition Numbers and Their Condition Numbers

Various normwise relative condition numbers that measure the sensitivity of matrix inversion and the solution of linear systems are characterized. New results are derived for the cases where two common, noninduced matrix norms are used, and where different vector norms are used for the domain and range of the matrix. Condition numbers that respect the structure of symmetric problems are also an...

متن کامل

Incidence dominating numbers of graphs

In this paper, the concept of incidence domination number of graphs  is introduced and the incidence dominating set and  the incidence domination number  of some particular graphs such as  paths, cycles, wheels, complete graphs and stars are studied.

متن کامل

Scale-free random graphs and Potts model

We introduce a simple algorithm that constructs scale-free random graphs efficiently: each vertex i has a prescribed weight Pi ∝ i−μ (0 < μ < 1) and an edge can connect vertices i and j with rate PiPj . Corresponding equilibrium ensemble is identified and the problem is solved by the q → 1 limit of the q-state Potts model with inhomogeneous interactions for all pairs of spins. The number of loo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The European Physical Journal B

سال: 2006

ISSN: 1434-6028,1434-6036

DOI: 10.1140/epjb/e2006-00377-4